Distributed virtual gateway appliance

ABSTRACT

Methods, computer program products, and systems are presented. The methods include, for instance: a gateway stack that includes a master, a backup, and at least one slave amongst nodes of the GS based on an election pursuant to a gateway stack protocol. The gateway stack provides gateway services for a Network Virtualization over Layer 3 (NVO3) network in a fail-safe manner by utilizing all of the nodes in the gateway stack. A data interface between the gateway stack and a switch is aggregated to evenly distribute inbound packets amongst the nodes of the gateway stack.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. application Ser. No.15/709,665, filed Sep. 20, 2017, titled “Distributed Virtual GatewayAppliance”, which is incorporated by reference herein in its entirety,which is a continuation of U.S. application Ser. No. 14/929,745 filedNov. 2, 2015 (U.S. Pat. No. 9,806,911, dated Oct. 31, 2017), titled“Distributed Virtual Gateway Applicant”, which is incorporated byreference herein in its entirety.

TECHNICAL FIELD

The present disclosure relates to virtualized resource optimization,including networking and computing resources, and more particularly tomethods, computer program products, and systems for providing avirtualized network environment by use of a coordinated group ofmultiple gateways.

BACKGROUND

Network Virtualization over Layer 3 (NVO3) is a technological frameworkin cloud computing and network virtualization, referring to an overlaynetwork that provides a Layer 2 (L2) or Layer 3 (L3) service to TenantSystems over an L3 underlay network using the architecture and protocolsas defined by the Internet Engineering Task Force (IETF) NVO3 taskforce.

L2 and L3 respectively refer to Layer 2 (Data Link Layer) and Layer 3(Network Layer) services of the Open Systems Interconnection model (OSIModel) comprising 7 layers. The Network Layer (L3) utilizes a data unitof packet, also referred to as a datagram. L3 functions may includestructuring and managing a multimode network, including addressing,routing and traffic control. Some examples of L3 protocols are InternetProtocol version 4 (IPv4), Internet Protocol version 6 (IPv6), InternetProtocol Security (IPsec), Datagram Delivery Protocol (DDP) in theAppleTalk suite, and Internet Control Message Protocol (ICMP). The DataLink Layer (L2) utilizes a data unit of bit/frame, to provide servicesof reliable transmission of data frames between two nodes connected by aphysical layer. Some examples of L2 protocols are Point-to-PointProtocol (PPP), IEEE 802.2 Logical Link Control (LLC), Layer 2 TunnelingProtocol (L2TP), and Media Access Control (MAC).

An NVO3 network may be separated from a traditional datacenter networkand the Internet. A device and/or a system that connect the NVO3 networkwith the traditional datacenter network and the Internet should functionas a gateway that interfaces with another network using differentprotocols. Some examples of gateway functionalities include, but are notlimited to, protocol conversion, routing, impedance adjustment, rateconversion, fault isolation, signal translation, and any otherfunctionality that negotiates differences amongst networks coupled tothe gateway, making the networks interoperable, such as mutuallyacceptable administrative procedures for both networks, etc. In thisspecification, one or more computer program that is configured toperform some of aforementioned gateway functionalities is referred to asa gateway, and the gateway runs on a computer system.

As the gateway functionalities are critical in cross-network datacommunication, the Virtual Router Redundancy Protocol (VRRP) iscurrently employed to provide uninterrupted gateway functionalitiesacross networks by providing a redundant gateway that may take over amain gateway in case of a failure on the main gateway.

SUMMARY

The shortcomings of the prior art are overcome, and additionaladvantages are provided, through the provision, in one aspect, of amethod. The method includes, for instance: forming a gateway stack (GS)that includes a master, a backup, and at least one slave amongst nodesof the GS based on an election pursuant to a gateway stack protocol(GSP), wherein the GS provides gateway services for a NetworkVirtualization over Layer 3 (NVO3) network in a fail-safe manner byutilizing all of the nodes in the GS, and wherein each node of the GS iscoupled to a switch via a data interface that is aggregated by a statictrunk that enables the switch to evenly distribute inbound data packetsamongst the nodes of the GS.

A method for providing a distributed virtual gateway for NetworkVirtualization over Layer 3 (NVO3) network is provided. The method, forexample, includes: forming a gateway stack (GS) comprising at leastthree (3) nodes, where the GS is an instance of the distributed virtualgateway, where the GS is formed amongst the nodes pursuant to a gatewaystack protocol (GSP) running on each of the nodes, such that the GSprovides Layer 2 or Layer 3 gateway services in a fail-safe manner byutilizing all of the nodes in the GS, where the formed GS has a master,a backup, and at least one slave respectively elected for each of thenodes, and where the master communicates with a controller and a policyserver via a management interface, and the GS is coupled to a switch viaa data interface; registering the GS with the controller and the policyserver such that the controller keeps GS registration information data,and the policy server keeps policy server list information data;configuring the nodes of the registered GS such that all nodes areenabled to autonomously process an inbound NVO3 data packet having adestination address known to a receiving node; and operating the GS,responsive to an associated type of a data packet and respective changesin an environment of the GS, where the data interface between the GS andthe switch is aggregated by static trunk such that the switch evenlydistributes inbound data packets amongst the nodes of the GS.

Additional features are realized through the techniques set forthherein. Other embodiments and aspects, including but not limited tocomputer program product and system, are described in detail herein andare considered a part of the claimed invention.

BRIEF DESCRIPTION OF THE DRAWINGS

One or more aspects of the present invention are particularly pointedout and distinctly claimed as examples in the claims at the conclusionof the specification. The foregoing and other objects, features, andadvantages of the invention are apparent from the following detaileddescription taken in conjunction with the accompanying drawings inwhich:

FIG. 1 depicts a cloud computing node in accordance with one or moreembodiments set forth herein;

FIG. 2 depicts a cloud computing environment in accordance with one ormore embodiments set forth herein;

FIG. 3 depicts abstraction model layers in accordance with one or moreembodiments set forth herein;

FIG. 4 depicts a physical topology for hardware components of a gatewaystack, in accordance with one or more embodiments set forth herein;

FIG. 5 depicts a system comprising physical and logical components of agateway stack, in accordance with one or more embodiments set forthherein;

FIG. 6A depicts a top level flowchart of the gateway stack presented inFIGS. 4-5, in accordance with one or more embodiments set forth herein;

FIG. 6B depicts the finite state machine of a node participating in thegateway stack, in accordance with one or more embodiments set forthherein;

FIG. 7A is a detailed flowchart of block 610 in FIG. 6A, depicting HelloProtocol processes as performed by each node of the gateway stack (GS),in accordance with one or more embodiments set forth herein;

FIG. 7B depicts a format of a Hello Packet used for the Hello Protocoldescribed in FIG. 7A, in accordance with one or more embodiments setforth herein;

FIG. 8 is a detailed flowchart of block 620 in FIG. 6A, depicting thegateway stack registration process performed by the master of the GS,the controller and the policy server, in accordance with one or moreembodiments set forth herein;

FIG. 9A is a detailed flowchart of block 630 in FIG. 6A, depicting thegateway stack operations performed by the master and members of the GS,the controller, the policy server and a switch, in accordance with oneor more embodiments set forth herein;

FIG. 9B is a detailed flowchart of blocks 930 and 940 in FIG. 9A, aswell as all blocks communicating with blocks 930 and 940, depicting howconfiguration and interface information is handled by the master andmembers of the GS, the policy server and the switch, in accordance withone or more embodiments set forth herein;

FIG. 9C is a detailed flowchart of block 960 in FIG. 9A, depicting howthe master handles regular gateway services requested of the GS, inaccordance with one or more embodiments set forth herein;

FIG. 9D is a detailed flowchart of block 9602 of FIG. 9C, depicting howa new member joins the GS, as performed by the master, the new member,the controller, and the policy server, in accordance with one or moreembodiments set forth herein;

FIG. 9E is a detailed flowchart of block 9603 of FIG. 9C, depicting howtraffic is handled by the GS as performed by the master and a member,collectively referred to as a gateway, in accordance with one or moreembodiments set forth herein;

FIG. 9F is a detailed flowchart of block 96032 of FIG. 9E, depicting howingress traffic is handled by the GS as performed by the master and amember, in accordance with one or more embodiments set forth herein; and

FIG. 9G is a detailed flowchart of block 96033 of FIG. 9E, depicting howcross-network traffic is handled by the GS as performed by the masterand a member, in accordance with one or more embodiments set forthherein.

DETAILED DESCRIPTION

Aspects of the present disclosure and certain features, advantages, anddetails thereof, are explained more fully below with reference to thenon-limiting examples illustrated in the accompanying drawings.Descriptions of well-known materials, fabrication tools, processingtechniques, etc., are omitted so as not to unnecessarily obscure thedisclosure in detail. It should be understood, however, that thedetailed description and the specific examples, while indicating aspectsof the invention, are given by way of illustration only, and not by wayof limitation. Various substitutions, modifications, additions, and/orarrangements, within the spirit and/or scope of the underlying inventiveconcepts will be apparent to those skilled in the art from thisdisclosure.

The present disclosure provides, in part, methods, computer programproducts, systems, network devices, and virtual machine managementsoftware for a distributed virtual gateway.

Reference is made below to the drawings, which are not drawn to scalefor ease of understanding, wherein the same reference numbers usedthroughout different figures designate the same or similar components.

FIGS. 1-3 depict various aspects of computing, including cloudcomputing, in accordance with one or more embodiments set forth herein.

It is understood in advance that although this disclosure includes adetailed description on cloud computing, implementation of the teachingsrecited herein are not limited to a cloud computing environment. Rather,embodiments of the present invention are capable of being implemented inconjunction with any other type of computing environment now known orlater developed.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g. networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines, and services) that canbe rapidly provisioned and released with minimal management effort orinteraction with a provider of the service. This cloud model may includeat least five characteristics, at least three service models, and atleast four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded automatically without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneousthin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned, in some cases automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active user accounts). Resource usage can bemonitored, controlled, and reported providing transparency for both theprovider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer isto use the provider's applications running on a cloud infrastructure.The applications are accessible from various client devices through athin client interface such as a web browser (e.g., web-based e-mail).The consumer does not manage or control the underlying cloudinfrastructure including network, servers, operating systems, storage,or even individual application capabilities, with the possible exceptionof limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer isto deploy onto the cloud infrastructure consumer-created or acquiredapplications created using programming languages and tools supported bythe provider. The consumer does not manage or control the underlyingcloud infrastructure including networks, servers, operating systems, orstorage, but has control over the deployed applications and possiblyapplication hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is to provision processing, storage, networks, and otherfundamental computing resources where the consumer is able to deploy andrun arbitrary software, which can include operating systems andapplications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off- premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting forload-balancing between clouds).

A cloud computing environment is service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure comprising anetwork of interconnected nodes.

Referring now to FIG. 1, a schematic of an example of a cloud computingnode is shown. Cloud computing node 10 is only one example of a suitablecloud computing node and is not intended to suggest any limitation as tothe scope of use or functionality of embodiments of the inventiondescribed herein. Regardless, cloud computing node 10 is capable ofbeing implemented and/or performing any of the functionality set forthhereinabove.

In cloud computing node 10 there is a computer system 12, which isoperational with numerous other general purpose or special purposecomputing system environments or configurations. Examples of well-knowncomputing systems, environments, and/or configurations that may besuitable for use with computer system 12 include, but are not limitedto, personal computer systems, server computer systems, thin clients,thick clients, hand-held or laptop devices, multiprocessor systems,microprocessor-based systems, set top boxes, programmable consumerelectronics, network PCs, minicomputer systems, mainframe computersystems, and distributed cloud computing environments that include anyof the above systems or devices, and the like.

Computer system 12 may be described in the general context of computersystem-executable instructions, such as program modules, being executedby a computer system. Generally, program modules may include routines,programs, objects, components, logic, data structures, and so on thatperform particular tasks or implement particular abstract data types.Computer system 12 may be practiced in distributed cloud computingenvironments where tasks are performed by remote processing devices thatare linked through a communications network. In a distributed cloudcomputing environment, program modules may be located in both local andremote computer system storage media including memory storage devices.

As shown in FIG. 1, computer system 12 in cloud computing node 10 isshown in the form of a general-purpose computing device. The componentsof computer system 12 may include, but are not limited to, one or moreprocessors or processing units 16, a system memory 28, and a bus 18 thatcouples various system components including system memory 28 toprocessor 16.

Bus 18 represents one or more of any of several types of bus structures,including a memory bus or memory controller, a peripheral bus, anaccelerated graphics port, and a processor or local bus using any of avariety of bus architectures. By way of example, and not limitation,such architectures include Industry Standard Architecture (ISA) bus,Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, VideoElectronics Standards Association (VESA) local bus, and PeripheralComponent Interconnects (PCI) bus.

Computer system 12 typically includes a variety of computer systemreadable media. Such media may be any available media that is accessibleby computer system 12, and it includes both volatile and non-volatilemedia, removable and non-removable media.

System memory 28 can include computer system readable media in the formof volatile memory, such as random access memory (RAM) 30 and/or cachememory 32. Computer system 12 may further include otherremovable/non-removable, volatile/non-volatile computer system storagemedia. By way of example only, storage system 34 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically called a “hard drive”). Although not shown, amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and an optical diskdrive for reading from or writing to a removable, non-volatile opticaldisk such as a CD-ROM, DVD-ROM or other optical media can be provided.In such instances, each can be connected to bus 18 by one or more datamedia interfaces. As will be further depicted and described below,memory 28 may include at least one program product having a set (e.g.,at least one) of program modules that are configured to carry out thefunctions of embodiments of the invention.

Program/utility 40, having a set (at least one) of program modules 42,may be stored in memory 28 by way of example, and not limitation, aswell as an operating system, one or more application programs, otherprogram modules, and program data. Each of the operating system, one ormore application programs, other program modules, and program data orsome combination thereof, may include an implementation of a networkingenvironment. Program modules 42 generally carry out the functions and/ormethodologies of embodiments of the invention as described herein.

Computer system 12 may also communicate with one or more externaldevices 14 such as a keyboard, a pointing device, a display 24, etc.;one or more devices that enable a user to interact with computer system12; and/or any devices (e.g., network card, modem, etc.) that enablecomputer system 12 to communicate with one or more other computingdevices. Such communication can occur via Input/Output (I/O) interfaces22. Still yet, computer system 12 can communicate with one or morenetworks such as a local area network (LAN), a general wide area network(WAN), and/or a public network (e.g., the Internet) via network adapter20. As depicted, network adapter 20 communicates with the othercomponents of computer system 12 via bus 18. It should be understoodthat although not shown, other hardware and/or software components couldbe used in conjunction with computer system 12. Examples, include, butare not limited to: microcode, device drivers, redundant processingunits, external disk drive arrays, RAID systems, tape drives, and dataarchival storage systems, etc.

Referring now to FIG. 2, illustrative cloud computing environment 50 isdepicted. As shown, cloud computing environment 50 comprises one or morecloud computing nodes 10 with which local computing devices used bycloud consumers, such as, for example, personal digital assistant (PDA)or cellular telephone 54A, desktop computer 54B, laptop computer 54C,and/or automobile computer system 54N may communicate. Nodes 10 maycommunicate with one another. They may be grouped (not shown) physicallyor virtually, in one or more networks, such as Private, Community,Public, or Hybrid clouds as described hereinabove, or a combinationthereof. This allows cloud computing environment 50 to offerinfrastructure, platforms and/or software as services for which a cloudconsumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 54A-N shownin FIG. 2 are intended to be illustrative only and that computing nodes10 and cloud computing environment 50 can communicate with any type ofcomputerized device over any type of network and/or network addressableconnection (e.g., using a web browser).

Referring now to FIG. 3, a set of functional abstraction layers providedby cloud computing environment 50 (FIG. 2) is shown. It should beunderstood in advance that the components, layers, and functions shownin FIG. 3 are intended to be illustrative only and embodiments of theinvention are not limited thereto. As depicted, the following layers andcorresponding functions are provided:

Hardware and software layer 60 includes hardware and softwarecomponents. Examples of hardware components include: mainframes 61; RISC(Reduced Instruction Set Computer) architecture based servers 62;servers 63; blade servers 64; storage devices 65; and networks andnetworking components 66. In some embodiments, software componentsinclude network application server software 67 and database software 68.

Virtualization layer 70 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers71; virtual storage 72; virtual networks 73, including virtual privatenetworks; virtual applications and operating systems 74; and virtualclients 75.

In one example, management layer 80 may provide the functions describedbelow. Resource provisioning 81 provides dynamic procurement ofcomputing resources and other resources that are utilized to performtasks within the cloud computing environment. Metering and Pricing 82provide cost tracking as resources are utilized within the cloudcomputing environment, and billing or invoicing for consumption of theseresources. In one example, these resources may comprise applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks, as well as protection for data and other resources.User portal 83 provides access to the cloud computing environment forconsumers and system administrators. Service level management 84provides cloud computing resource allocation and management such thatrequired service levels are met. Service Level Agreement (SLA) planningand fulfillment 85 provide pre-arrangement for, and procurement of,cloud computing resources for which a future requirement is anticipatedin accordance with an SLA.

Workloads layer 90 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation 91; software development and lifecycle management 92; virtualclassroom education delivery 93; data analytics processing 94;transaction processing 95; and a distributed virtual gateway processing96 as described herein.

Program/utility 40 as set forth in FIG. 1 can provide the functionalityof the distributed virtual gateway processing 96 as set forth in FIG. 3.The distributed virtual gateway processing 96 may be a component of thevirtualization layer 70.

Referring again to FIG. 1:

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

FIG. 4 depicts a physical topology for hardware components of a gatewaystack (GS) 100, in accordance with one or more embodiments set forthherein.

The GS 100 includes a switch 110, gateway A 120, gateway B 130, gatewayC 140, and network 59.

The switch 110 is a network switch to interconnect the gateway A 120,the gateway B 130, the gateway C 140, and the network 50 of FIG. 2, byuse of respective ports of the switch 110. The switch 110 uses hardwareaddresses, also referred to as Media Access Control (MAC) addresses, orphysical addresses, to process and forward data at the Data Link Layer(L2) of the OSI model. In this specification, the switch 110 is aninstance of a Layer 3 switch, or a multilayer switch, which is capableof processing data at the Network Layer (L3) by additional routingfunctionality that typically uses Internet Protocol (IP) addresses toperform packet forwarding, by use of a forwarding table.

The gateway A 120, the gateway B 130, and the gateway C 140 representmultiple gateways employed in the GS 100, particularly three or morephysical gateway appliances according to one embodiment of the presentinvention. In this specification, term “gateway appliance” refers to apiece of a physical computer system that functions as a gateway. Typicalgateway appliances have hardware and software configurations that werepre-set by a manufacturer such that a user may easily use the gatewayappliance with minimal administrative effort. In this specification,while terms “gateway” and “node” may interchangeably indicate both aphysical and/or a logical gateway, the term “gateway appliance”exclusively refers to a piece of a physical computer system functioningas a gateway.

The network 50 of FIG. 2 depicts a physical network external to aprivate network represented by the gateway A 120, the gateway B 130, andthe gateway C 140. See description of FIG. 2 for details of the network50.

FIG. 5 depicts a system 500 comprising physical and logical componentsof a gateway stack (GS) 510, in accordance with one or more embodimentsset forth herein.

Because gateway functionalities are critical in cross-network datacommunication, the Virtual Router Redundancy Protocol (VRRP) isconventionally employed to provide uninterrupted gateway functionalitiesacross networks by providing a redundant gateway that may take over amain gateway in case of a failure on the main gateway. Whilst the VRRPprovides a dependable fail-safe mechanism, the VRRP utilizes only fiftypercent (50%) of resources deployed for the gateway, including computersystems, computer programs, network bandwidth, etc. Also, because theVRRP supports only two (2) gateway setups having a master and a slave,and because the master provides gateway functionalities alone until themaster suffers a failure, thence the slave takes over and servicesnetworks alone as previously done by the master, the volume ofcommunication is bound by the network bandwidth that can be processed byone server that services as the gateway at the time, that is either themaster or the slave, but not both at one time. Also, because themaster/slave mode of the VRRP does not support a multi-nodeconfiguration, no fail-safe gateway services are available when themaster and the slave both fail. The system 500 advantageously addressesthe problems set forth as above.

The system 500 includes the GS 510, a first network 59A, a secondnetwork 59B, an overlay virtual machine (VM) 550, and the switch 110 ofFIG. 4, which provides physical connections for data communicationamongst the GS 510, the second network 50B, and the overlay VM 550. Thefirst network 59A and the second network 59B are respective instances ofthe network 59 of FIG. 4.

The GS 510 includes a master 520, a backup 530, and a slave 540 of oneor more slaves of the GS 510. The gateways 520, 530, and 540 arephysically linked to the switch 110 as shown in FIG. 4, and the master520, the backup 530, and the slave 540 respectively refer to roleswithin the GS 510, as assigned to each gateway after the GS 510 isformed according to the processes presented hereinafter. See descriptionof FIGS. 6A, 6B, 7A, and 7B for details of GS formation. In thisspecification, the master 520 of the GS 510 performs a unique set offunctions exclusive for the master 520, and, to distinguish the master520 from the rest of gateways in the GS 510, the term “member” is usedhereinafter to indicate the gateways of the GS 510 other than the master520. See descriptions of FIGS. 6A, 6B, 7A, 7B, 8, 9A, 9B, 9C, 9D, 9E,9F, and 9G for details of process flow and operations of the GS 510.

The GS 510 is a logical gateway device that operates at any networklayer in the OSI model and communicates using more than one protocol,converting protocols according to configuration as in conventionalgateways. Particularly, the GS 510 virtualizes a network over Layer 3,as noted in this specification a Network Virtualization Over Layer 3(NVO3) gateway, such that the network linked to the GS 510 may not beaware that the network is carrying NVO3 packets. The network is referredto as an underlay network, and carries such NVO3 packets as encapsulatedas a result of tunneling. The underlay network may use a protocol andaddress completely different from a protocol and address of the overlay.According to one or more aspects of this specification, the underlaynetwork of the NVO3 gateway, that is the GS 510, is IP at Layer 3. Seedescriptions of FIGS. 9A, 9C, 9E, 9F, and 9G for details of NVO3 packetprocess.

The gateways 520, 530, and 540 of the GS 510 include a management port(M) and at least one data port (D). Each management port 520:M, 530:M,and 540:M, is coupled to the first network 50A such that the gateways520, 530, and 540 of the GS 510 communicate with a controller 560 withinthe first network 50A for administrative purposes related toregistration and configuration of the GS 510. The controller 560 is aninterface between the GS 510 and a user 599, who has administrativecontrol over the GS 510 such as enabling the GS 510. A policy server 570within the first network 50A stores registration information andinterface information of the GS 510.

As the GS 510 is one logical gateway regardless of the number ofphysical gateways participating in the GS 510, individual gateways 520,530, and 540 of the GS 510 are invisible to the second network 50B andthe overlay VM 550, which attempt to communicate with destinationcomputer systems in a network serviced by the GS 510 using at least oneoverlay protocol that needs tunneling. Each data port 520:D, 530:D, and540:D coupled to the switch 110 handles data traffic according to theconfiguration of and interfaces set for the GS 510. The ports on theswitch 110 connecting data ports 520:D, 530:D, and 540:D are aggregatedby a static trunk such that data traffic incoming to the GS 510 isdistributed over the data ports 520:D, 530:D, and 540:D of the GS 510.Also, wherein there is more than one data port in gateways, 520, 530,and 540, to distribute the upload data traffic over all available dataports, various techniques of network bounding may be used. Examples oflink aggregation techniques may be, but are not limited to, theInstitute of Electrical and Electronics Engineers (IEEE) 802.1AX-2008standard, the IEEE specification of the Link Aggregation ControlProtocol (LACP), etc.

The master gateway 520 communicates with the controller 560 to registerinformation of the GS members and to resolve configuration issuesamongst the member nodes of the GS. See the descriptions of FIGS. 6A and8 for details of the GS registration. The backup gateway 530 and theslave gateway 540 may independently process data traffic pursuant to theconfiguration provided by the master 520, and notify the master 520 whennecessary. See the descriptions of FIGS. 6A, and 9A through 9G, fordetails of the GS operation of processing NVO3 packets. When the mastergateway 520 does not function properly, the backup gateway 530 takesover and becomes a new master of the GS 510, and a new backup iselected.

In one embodiment of the present invention, virtual machines of FIG. 5including the master 520, the backup 530, the slave 540, and the overlayvirtual machine (VM) 550, run on a respective hypervisor platform, whichruns on a respective server/mainframe computer. The respectiveserver/mainframe computer may be one of mainframes 61, RISC basedservers 62, servers 63, and blade servers 64, storage devices 65, andnetworks and networking components 66 of FIG. 3, and/or combinationsthereof, that implements the computing node 10, or the computer system12 of FIG. 1. To negotiate standard/proprietary network protocols, thenetwork application server software 67 of FIG. 3 is also employed. Therespective hypervisor platform provides a complete virtual computingenvironment such as virtualization layer 70 of FIG. 3. In the sameembodiment of the present invention, the GS is deployed to establish theIBM® Software Defined Network for Virtual Environments (SDN VE). (IBM isa registered trademark of International Business Machines Corporation,Armonk, N.Y., USA.)

FIG. 6A depicts a top level flowchart 600 of the gateway stack (GS) 510presented in FIGS. 4-5, in accordance with one or more embodiments setforth herein.

Block 610 “GS formation” illustrates that the GS 510 is formed amongst agroup of gateways. See the description of FIG. 7A for details of GSformation as performed by each gateway participating in the GS 510. TheGS formation process utilizes Hello Protocol run by a respective gatewayof the GS 510, passing Hello Packets (FIG. 7B) back and forth. See thedescription of FIG. 7B for details of Hello Packet composition. Inresponse to formation of the GS 510, participating gateways are assignedto a respective role, and the gateway elected as a master of the GS 510during the GS formation drives registration and configuration of thegateways of the GS 510.

Block 620 “GS registration” illustrates that the GS 510 completesregistration of the participating gateways with a controller/policyserver of the GS 510 in response to the GS formation of block 610. Themaster registers the gateways with the controller/policy server, andconfigures the nodes for gateway services such that the GS 510 willvirtually function as one logical gateway appliance regardless of thenumber of gateways participating in the GS 510. See the description ofFIG. 8 for details of GS registration.

Block 630 “GS operation” illustrates that GS 510 performs gatewayservices in response to the registration completed in block 620. See thedescriptions of FIGS. 9A through 9G for details of the GS operation.

FIG. 6B depicts a finite state machine (FSM) of a node participating inthe gateway stack (GS) 510, in accordance with one or more embodimentsset forth herein.

In one embodiment of the present invention, the node of the GS 510 hasfour states: Down 650, Init 660, Connected (CNCT) 670, and Peer-Up(PRUP) 680.

Down 650 is the start state of the node, as represented by the doublecircle and Arrow E1. In Down 650 state, the node does not communicatewith other nodes of the GS 510. When the node is enabled by auser/controller, which is an event indicated by Arrow E2, the state ofthe node evolves to Init 660.

Init 660 is a second state of the four states, in which the node beginscommunicating with other nodes according to Hello Protocol. In Init 660state, the node periodically sends Hello packets to other nodes andcontinuously monitors reception of Hello packets sent by neighbor nodes.See the description of FIG. 7A for details of activity in executing theHello Protocol. See the description of FIG. 7B for details of a HelloPacket. In response to the node ascertaining that a network identifier(NID) associated with the node is found in the Hello packets receivedfrom the neighbor nodes, which is an event indicated by Arrow E3, thestate of the node evolves to Connected 670.

Connected 670 is a third state of the four states, in which the nodeprepares the operations of the GS 510 by electing a master and a backupamongst all participating nodes according to the Hello Protocol. InConnected 670 state, the node continues monitoring Hello packetsreceived from neighbor nodes to check if the communication staysbidirectional. If the NID associated with the node is not found in theHello packets received from the neighbor nodes, which is an eventindicated by Arrow E4, the state of the node reverts to Init 660. Inresponse to the node in Connected 670 state, provided the communicationstays bidirectional, ascertaining that the master/backup/slave roles arerespectively specified for nodes of the GS 510 and a management IP(mgmtIP) address has been assigned to the master for communication withthe controller and/or the policy server, which is an event indicated byArrow E5, the state of the node advances to Peer-Up 680.

As noted earlier, the term “member” is used to indicate a gateway/nodeother than a master, including a backup or a slave gateway/node, basedon the result of the election.

Peer-Up 680 is the fourth and the most advanced state of the four statesof the node, in which the nodes of the GS 510 operate as a logicalgateway device. The master of the GS 510 first registers members of theGS 510 with the controller and/or the policy server, and synchronizesdata with the members. See the description of FIG. 8 for details of theGS registration. In response to the GS registration is successfullycompleting, the GS 510 operates by processing NVO3 packets. See thedescriptions of FIGS. 9A through 9G for details of the GS operation. InPeer-Up 680 state, the node continues monitoring activities, and inresponse to a timer specifying a permitted time duration without anyactivity expiring, referred to as “Timer Out”, or in response to thenode is not being able to communicate with a neighbor node, the state ofthe node reverts to Init 660, as the node is deemed disconnected, whichis an event indicated by Arrow E7. Further in Peer-Up 680 state, ifevents indicated by Arrow E6 occurs, such as the node is turned off orGS 510 functionality is disabled, then the state of the node reverts toDown 650, as the node cannot service NVO3 packets.

FIG. 7A is a detailed flowchart of block 610 in FIG. 6A, depicting HelloProtocol processes as performed by each node of the gateway stack (GS)510, in accordance with one or more embodiments set forth herein. Seethe description of FIG. 7B for details on fields of a Hello Packet usedfor the Hello Protocol.

In block 710, the node detects a first event that a user enabled thenode for the GS 510. Prior to block 710, the node is initially in “Down”state, in terms of the four states of FSM described in FIG. 6B. The nodeproceeds with block 715.

In block 715, the node changes the state of the node to “Init” state, inresponse to the first event of being enabled in block 710. The nodeproceeds with block 720.

The sequence corresponding to blocks 720, 725, and 735 of FIG. 7A arerepeatedly performed while the node is in “Init” state, until theconditions of blocks 725 and 735 are satisfied, indicating that during“Init” state, the node periodically sends out Hello packets, andmonitors and processes Hello packets coming from neighbor nodes toascertain the node has established bidirectional communication with allother nodes in the GS 510.

In block 720, the node sends an initialized Hello Packet to a multicastdestination IP address (dIP) 224.0.0.241, to send the Hello Packet toevery other node of the GS 510. The Hello Packets are sent out once in atime period set by the value of HelloInterval field [R20:B0-B1] of FIG.7B, of the Hello Packet. Responsive to other nodes of the GS 510 sendingthe Hello Packets, the node also receives Hello Packets from othernodes. The node proceeds with block 725.

In block 725, the node checks, in the received Hello Packet, if themulticast destination IP address (dIP) is set as 224.0.0.241 and the UDPdestination port (dPort) is set as 10050, according to the values fordIP and dPort, respectively, predefined for the Hello Protocol. Thesource port number range corresponding to the dPort 10050 is[10052-10100]. If the node ascertains both that the dIP is 224.0.0.241and that the dPort is 10050, then the node proceeds with block 735.Otherwise, the node discards the received Hello Packet and loops back toblock 720.

In block 735, the node checks if the Hello Packet received in block 720has a network identifier (NID) that uniquely identifies the node withinthe GS 510 listed in the Neighbor field, indicating that the node andthe sender of the received Hello Packet had established bidirectionalcommunication. If the node discovers the NID of the node in the receivedHello Packets from all other nodes of the GS 510, then the node proceedswith block 740. Otherwise, the node loops back to block 720.

Blocks 720 is performed periodically pursuant to the value ofHelloInterval field in the Hello Packet, and blocks 725 and 735 forexamining received Hello Packets, which is performed for every incomingpacket, may be performed concurrently, while the node is in “Init”,“Connected”, and “Peer-Up” states.

In block 740, the node changes the state of the node to “Connected”based on the conditions satisfied in blocks 725, 730, and 735,indicating that the node has established bidirectional communicationwith all other nodes in the GS 510. Then the node proceeds with block745.

In block 745, the node determines if a master and a backup of the GS 510have been elected by use of predefined election rules. In response toexchanging and processing Hello Packets with other nodes of the GS 510in blocks prior to 745, the node examines a specific field of the HelloPacket selected by the predefined election rules and may determine whichnode should be the master/backup. All non-elected nodes become slaveswithin the GS 510. In one embodiment of the present invention, the nodeelects a first node having the greatest IP address as a master, and asecond node having the second greatest IP address as a backup. Once themaster and the backup are elected, the rest of the nodes in the GS 510becomes slaves. In another embodiment of the present invention, the nodeelects a first node sending a first Hello Packet having the greatestvalue in the GwPriority field [R20:B3], FIG. 7B, of the first HelloPacket as a master, and a second node sending a second Hello Packethaving the second greatest value in the GwPriority field [R20:B3], FIG.7B, of the second Hello Packet as a backup. The node stays at block 745until the node determines that the election is successfully completedwhile continuously examining incoming Hello Packets to see if values inthe Master IP Address field (MasterIP[R36] of FIG. 7B) and the Backup IPAddress field (BackupIP[R32] of FIG. 7B) are both non-zero, whichindicates the election is completed. If the node determines that theelection is completed, then the node proceeds with block 750.

In block 750, the node changes the state of the node to “Peer-Up”, inwhich the GS 510 is successfully formed having bidirectionalcommunication established among all participating nodes of the GS 510,and the master/backup/slave roles respectively assigned to each node ofthe GS 510. As noted earlier, in response to the master being elected inblock 745, the backup and the slaves are referred to as a “member”during the GS registration and GS operation, in the descriptions ofFIGS. 8, 9A, 9B, 9C, 9D, 9E, 9F, and 9G, hereinafter. As the GSformation is completed, a new Media Access Control (MAC) address for theGS 510 is automatically generated by a virtual network adapter in avirtual machine running the master node. Also, a Management IP Address(MgmtIP[R4] of FIG. 7B) is created for the GS 510 to communicate withthe controller by the virtual machine running the master node. The nodeproceeds with block 755.

In block 755, the node checks whether or not an activity timer(DeadInterval [R24] of FIG. 7B) had expired. If the node determines thatthe activity timer has not expired, the node stays in “Peer Up” stateand continues checking the activity timer in block 755. The GS 510operates normally when each node participating in the GS 510 isrespectively staying in block 755. If the node determines that theactivity timer has expired, indicating that the node is no longeroperational, then the node loops back to block 715, changing the stateof the node to “Init”. In another embodiment of the present invention,the node may change the state of the node to “Down”, as noted in thedescription of FIG. 6B.

FIG. 7B depicts a format of a Hello Packet 790 used for the HelloProtocol described in FIG. 7A, in accordance with one or moreembodiments set forth herein.

Field VersionNo [R0:B0] indicates a version number of the Hello Protocolof the Hello Packet, denoted as the VersionNo field. In one embodiment,VersionNo=1 specifies a present version, and VersionNo=2 is reserved fora future revision of the Hello Protocol.

Field PacketType [R0:B1] set to 1 to indicates that the present versionof the Hello Protocol supports only Hello Packets.

Field PacketLength [R0:B2-B3] indicates the length of the Hello Packetin bytes.

Field MgmtIP [R4] is an IP address of a management interface which isused to send/receive Hello Packets.

Field Checksum [R8:B0-B1] indicates a standard IP checksum of the entirecontents of the Hello Packet.

Field AuthType [R8:B2-B3] indicates the authentication procedureemployed to authenticate the Hello Packet, for example, nullauthentication, MD5, text authentication, etc.

Field Authentication [R12] may indicate a 64-bit field used for theauthentication scheme. In one embodiment of the present invention, theAuthentication [R12] field is determined by the AuthType field.

Field NetMask [R16] indicates a network mask associated with thisinterface.

Field HelloInterval [R20:B0-B1] indicates a time lapse, in seconds,between two consecutive Hello Packets transmitted by a node on themanagement interface. The value of the HelloInterval field is advertisedto neighboring nodes of the GS 510.

Field Options [R20:B2] indicates whether or not the node is set tosupport optional functionalities such as enabling a node to rejectcommunication with a neighbor node that has distinctive optionalfunctionalities from the node. In one embodiment, the Options field isset to 0 to indicate the node does not support optional functionalities.

Field GwPriority [R20:B3] holds a non-negative integer utilized todetermine a master of the GS 510. A node having a greatest value in theGwPriority [R20:B3] field is to be elected as a master during the GSformation. Also, another node having the value zero (0) in theGwPriority [R20:B3] field is not eligible for a master of the GS 510.The value of the HelloInterval field is advertised to neighboring nodesof the GS 510.

Field DeadInterval [R24] indicates a duration of time, in seconds, inwhich the node may stay inactive while in the “Peer Up” state. In oneembodiment of the present invention, where the node does not generateany traffic during a period set by the value of the DeadInterval field,neighboring nodes may declare the inactive node as in “Init” state. Thevalue of the DeadInterval field is advertised to neighboring nodes ofthe GS 510.

Field VirtualIP [R28] indicates a virtual IP address of the GS 510, ascreated for the GS 510 to communicate with a controller and a policyserver.

Field BackupIP [R32] indicates a virtual IP address of a node elected asa backup within the GS 510 by the Hello Protocol. The backup node takesover the GS 510 and becomes a master where the master node fails. Thefield BackupIP is initialized to 0.0.0.0 before the Hello Protocol runs,which indicates that no backup node has been elected yet.

Field MasterIP [R36] indicates a virtual IP address of a node elected asa master within the GS 510 by the Hello Protocol. The master node drivesthe registration of the GS 510 nodes with the controller, as well ascontrols traffic, synchronizes configuration with member nodes of the GS510, etc, as described hereinafter. The field MasterIP is initialized to0.0.0.0 before the Hello Protocol runs, which indicates that no masternode has been elected yet. In response to the node being elected asmaster, values of the MasterIP and the VirtualIP fields are identical,as the GS 510 is represented by the virtual IP address of the master.

Field Neighbor [R40] indicates a list of participating nodes of the GS510, which is formed by running the Hello Protocol. An “adjacency”relationship is established between master/backup and other nodes,except between two slave nodes of the GS 510.

The rest of the fields [R44] in the Hello Packet indicate neighbors thathave not been listed.

FIG. 8 is a detailed flowchart of block 620 in FIG. 6A, depicting thegateway stack registration process performed by the master of the GS510, the controller and the policy server, in accordance with one ormore embodiments set forth herein.

At the conclusion of block 610 of FIG. 6A, in response to the masterbeing elected and the registration being completed, all participatingnodes of the GS 510, members and the master alike, are represented byand accessed through one logical address as the GS 510, the value of theVirtualIP field in the Hello Packets. Even when the master is down, thebackup takes over the master's place, and the GS 510 continues operationas the same logical device represented by the same logical addresswithout triggering another round of the GS registration. The mastersynchronizes registration and/or configuration information of the GS 510as necessary throughout the GS operations. Then the master proceeds withblock 830.

In block 830, the master sends the GS registration information to thecontroller. In one embodiment of the present invention, a virtual tunnelIP address of the GS 510 is registered with the controller, as specifiedby the IBM® software-defined network for virtual environments (SDN VE).Then the master waits for the controller to respond.

In block 840, the controller receives the GS registration informationsent from the master in block 830. Prior to block 840, as the nodesparticipating in the GS 510 may not be individually registered with thecontroller until the GS 510 is fully formed and the master is elected,the controller is not aware of any nodes, or the GS gateway appliance.In response to obtaining the GS registration information, the controllerregisters all of the participating nodes of the GS 510 as one gatewayappliance for future data traffic accessible by the logical address ofthe master, virt mgmt ip, as shared by the master with the members. Thecontroller remains unaware of how many nodes are participating in the GS510, as well as other details of individual nodes, because the GS 510 isencapsulated and fully virtualized as one logical gateway appliance.Then the controller proceeds with block 850.

In block 850, the controller pushes, to a policy server, the GSregistration information obtained in block 840 and pushes, to themaster, by use of the virtual address registered in block 840, thepolicy server list information obtained from the policy server. Thepolicy server list information includes information such as IP addressof the overlay virtual machines (VMs), media access control (MAC)addresses of the overlay VMs, Tunnel End Point IP (TEP-IP) addresses ofthe overlay VMs, network-identifiers of the overlay VMs, etc. Then thecontroller concludes the GS registration and proceeds with the GSoperation of block 630 in FIG. 6A, detailed in the flowcharts of FIGS.9A through 9G.

In block 860P, the policy server, as forced by the controller from block850, updates the GS registration information. Then the policy serverconcludes the GS registration and proceeds with the GS operation ofblock 630 in FIG. 6A, detailed in flowcharts of FIGS. 9A through 9G.

In block 860M, the master, as forced by the controller from block 850,updates the policy server list information. Then the master concludesthe GS registration and proceeds with the GS operation of block 630 inFIG. 6A, detailed in the flowcharts of FIGS. 9A through 9G.

FIG. 9A is a detailed flowchart of block 630 in FIG. 6A, depicting thegateway stack operations performed by the master and members of the GS510, the controller, the policy server and a switch, in accordance withone or more embodiments set forth herein.

In block 910, the master requests and obtains the GS configurationinformation from the controller. Then the master proceeds with block930.

In block 920C, the controller provides, to the master, the GSconfiguration information in response to the request for the GSconfiguration information as received from the master performing block910. Then the controller interacts with the GS 510 only when anotherrequest is made to the controller.

In block 930, the master synchronizes the GS configuration informationwith the members of the GS 510. See the description of FIG. 9B fordetails of how the master handles the GS configuration informationamongst the members of the GS 510. Then the master proceeds with block940.

In block 935G, a member of the GS 510 synchronizes the GS configurationinformation with the master, as the GS configuration information isrelayed from the master in block 930. See the description of FIG. 9B fordetails of how the member synchronizes the GS configuration information.Then the member proceeds with block 960 of regular GS operations.

In block 940, the master registers interfaces presented in the GSconfiguration information with the policy server and the switch. See thedescription of FIG. 9B for details of how the master handles theinterfaces. Then the master proceeds with block 960.

In block 945P, the policy server registers the interface informationsent from the master, wherein the interfaces have been updated accordingto the GS configuration information. See the description of FIG. 9B fordetails of block 945P. Then the policy server interacts with the GS 510in response to a further request being made to the policy server.

In block 945S, the switch updates a forwarding table of the switchpursuant to the interface information from the master sent in block 940.See the description of FIG. 9B for details of block 945S. Then theswitch interacts with the GS 510 in response to another forwarding tableupdate being requested by the master.

In block 960, the master leads the GS 510 in regular operations of theGS 510 as the GS 510 is fully configured and functional as a gatewayappliance. See the description of FIG. 9C for details of how the masterfunctions in the regular operations of the GS 510. The master runs block960 until the master changes the state to “Down” or the activity timerexpires and changes the state to “Init”.

FIG. 9B is a detailed flowchart of blocks 930 and 940 in FIG. 9A, aswell as all blocks communicating with blocks 930 and 940, depicting howconfiguration and interface information is handled by the master andmembers of the GS 510, the policy server and the switch, in accordancewith one or more embodiments set forth herein.

In block 9301, the master creates a configuration file for gatewayservices of the GS 510, based on the configuration information obtainedfrom the controller. Wherein the GS 510 is deployed as a public gatewaythat is a Layer 3 gateway connecting to an external public network suchas Internet, the configuration file includes Tunnel End Point IP(TEP-IP), External IP (EXT-IP), Source and Destination Network AddressTranslation (SNAT) pool and forwarding rules. Wherein the GS 510 isdeployed as a legacy gateway that is a Layer 2 gateway connecting to alegacy network such as Data center, the configuration file includesTEP-IP and VLAN mappings. Active dynamic session information is storedin a database/storage of the master. Then the master proceeds with block9302.

In block 9302, the master creates interfaces necessary for the gatewayservice pursuant to the configuration file generated in block 9301. Inone embodiment of the present invention, the master creates interfacesof the TEP-IP and EXT-IP, SNAT pool, forwarding rules and VLAN mapping.Then the master proceeds with block 9303.

In block 9303, the master synchronizes respective configuration files ofeach member of the GS 510 with the configuration file created from block9301. Then the master proceeds with block 9404.

In block 9351G, each member of the GS 510 updates a respectiveconfiguration file based on the synchronization request from the masterin block 9303. Then each member installs interfaces for the respectivenode based on the updated configuration file in block 9352G.Accordingly, each member gateway has all the interfaces of theconfiguration file installed such that each member gateway is capable ofsupporting communication in the TEP-IP and EXT-IP, SNAT pool, forwardingrules and VLAN mapping and the dynamic sessions. Then each member of theGS 510 is ready to service traffic as a NVO3 gateway.

In block 9404, the master registers a Tunnel End Point (TEP) IP addresswith the policy server. The GS 510 is associated with the TEP-IP addressthat serves a Layer 3 (L3) connectivity to a destination external to theoverlay network. Tunneling enables the encapsulation of a packet fromone type of protocol within the datagram of a different protocol. Forexample, a Virtual Private Network (VPN) uses Point-to-Point TunnelingProtocol (PPTP) to encapsulate IP packets over a public network, such asthe Internet. In one embodiment of the present invention, a humanadministrator interacting with the controller configures the TEP-IP ofthe GS 510. When the master takes the configuration information from thecontroller in block 910 of FIG. 9A, the master acquires the TEP-IP andthen propagates the TEP-IP to members of the GS 510 in blocks 9301,9302, and 9303. Then the master proceeds with block 9405.

In block 9451P, in response to the master performing block 9404, thepolicy server registers the TEP-IP interface information of the mastersuch that the GS 510 may service as a NVO3 gateway. Then the policyserver interacts with the GS 510 only in response to another requestbeing made to the policy server.

In block 9405, the master sends out Address Resolution Protocol (ARP)packets, to advertise destination addresses the GS 510 may handle. Thenthe master proceeds with 960 of FIG. 9A, which is detailed in FIG. 9C.

In block 9452S, the switch receives the ARP packet sent by the master inblock 9405. Then in block 9453S, the switch updates a forwarding tableof the switch according to the address information of the received ARPpacket. Then the switch interacts with the GS 510 only in response toanother request being made to the switch.

FIG. 9C is a detailed flowchart of block 960 in FIG. 9A, depicting howthe master handles regular gateway services requested of the GS 510, inaccordance with one or more embodiments set forth herein.

In block 9601, the master determines a type of the event occurring alongthe GS operation. If the master cannot communicate with the members ofthe GS 510 because of any reason such as power-off or link-down, themaster node changes the state of the node to “Down” or “Init” state.Then the backup node takes over as a new master of the GS 510, theVirtualIP address for the GS 510 is assigned to the new master, and theGS 510 continues providing gateway services. As noted earlier, when thebackup takes over the master, the GS registration information stays thesame as before, and consequently, there is no need to interact with thecontroller. Also, because the policy server communicates with the GS 510by use of the VirtualIP address, in response to the backup beingassigned with the VirtualIP address, the GS 510 may communicate with thepolicy server without intervention by the controller. The master may bereinstated and join the GS 510 later on according to administrativedecisions.

If the master determines that there is a new member to join the GS 510in block 9601, then the master proceeds with block 9602. See thedescription of FIG. 9D for details of how the master adds the new memberto the GS 510. In response to the new member joining the GS 510, themaster loops back to block 9601.

If the master determines that the GS 510 has traffic to provide gatewayservices in block 9601, then the master proceeds with block 9603. Seethe description of FIG. 9E for details of how the GS 510 handlestraffic. In response to the traffic being properly handled, the masterloops back to block 9601.

FIG. 9D is a detailed flowchart of block 9602 of FIG. 9C, depicting howa new member joins the GS 510, as performed by the master, the newmember, the controller, and the policy server, in accordance with one ormore embodiments set forth herein.

Prior to block 960201N, a new gateway hardware is prepared offline,without any configuration information, by a human administrator. The newgateway hardware may be a new computer system, or a gateway hardwarepreviously used for the GS 510 after reset of the configurationinformation.

In block 960201N, the new member requests the master to synchronize theconfiguration file via a management network using stacking headerencapsulation in the OSI protocol stack. Then the new member waits forthe response from the master.

In block 960202M, the master obtains the request sent in block 960201Nfrom the new member. Then the master proceeds with block 960203M.

In block 960203M, the master pushes a configuration file of the masternode to the new member from block 960202M. The configuration file of themaster is up-to-date and configures all interfaces necessary for gatewayservices of the GS 510. Then the master concludes block 9602 as the newmember successfully joined the GS 510.

In block 960204N, the new member updates the configuration file of thenew member according to the configuration file of the master, asreceived from block 960203M. Then the new member installs interfaces ofthe updated configuration file in block 960205N. Then the new memberwaits until the master concludes the joining process of block 9602.

FIG. 9E is a detailed flowchart of block 9603 of FIG. 9C, depicting howtraffic is handled by the GS 510 as performed by the master and amember, collectively referred to as a gateway, in accordance with one ormore embodiments set forth herein.

In block 96031, the gateway detects traffic on the port of the gatewayand determines the type of the traffic detected. If the gatewaydetermines that the next hop of the traffic is the GS 510, then thegateway proceeds with block 96032 to process ingress traffic. See thedescription of FIG. 9F for details of the ingress traffic process. Ifthe gateway determines that the traffic is heading to theswitch/external network, then the gateway proceeds with block 96033 toprocess network to network traffic. See the description of FIG. 9G fordetails of how the GS 510 handles the network-to-network traffic.

FIG. 9F is a detailed flowchart of block 96032 of FIG. 9E, depicting howingress traffic is handled by the GS 510 as performed by the master anda member, in accordance with one or more embodiments set forth herein.

Prior to block 960321, the switch ports, coupling the external networkto network interface cards (NICs) of computer systems running the GS510, are aggregated beforehand by method of static trunk such that anypacket heading to the GS 510 may be received by any node of the GS 510.Conversely, uplink ports on the NICs of the GS 510 to the externalswitch may be also aggregated by various techniques such as NIC teaming,according to the need. By use of a static trunk on the external switchon the interface to the GS 510, if a data packet is incoming to the GS510, hereinafter referred to as an ingress packet, the external switchhashes the packet on the static trunk, and, as a result, the ingresspacket is forwarded to any node of the GS 510. The static trunk on theexternal switch enables the GS 510 to be utilized to the fullest inprocessing traffic, in contrast with conventional redundant gatewayswhere a backup idles while a master alone processes traffic. Theprocesses of FIG. 9F does not describe cases of normal Ethernet packettraffic as the external switch forwards normal Ethernet packets to theexternal network based on the MAC address table or the forwarding tableof the external switch.

In block 960321, the member determines a type of the ingress packet. Ifthe member determines that the ingress packet is a NetworkVirtualization over Layer 3 (NVO3) packet other than an AddressResolution Protocol (ARP) reply, then the member proceeds with block960322A. If the member determines that the ingress packet is an ARPreply, then the member proceeds with block 960322B.

In block 960322A, the member processes the NVO3 packet according to theinterfaces installed pursuant to the configuration file. In oneembodiment of the present invention, the members respectively haveTEP-IP, EXT-IP, SNAT pool, forwarding rules, and virtual local areanetwork (VLAN) mapping installed on the node, according to blocks 930and 940 of FIG. 9A, and FIG. 9B. Then the member proceeds with block960323.

In block 960322B, the member encapsulates the ARP reply and forwards theencapsulated ARP reply to the master. As the ARP reply is received inresponse to a previous ARP request, the master may have sent out theprevious ARP request, but the ARP reply was likely to arrive at themember because the master and the member use an identical Virtual IPaddress for the GS 510. For the master to resolve address/routinginformation in the ARP reply, the member forwards the ARP reply to themaster.

In block 960323, the member examines the address of the ingress packet.If the member determines that the member knows the forwarding address ofthe ingress packet as the member had previously learned the address fromthe master according to the ARP, then the member proceeds with block960324A. If the member determines that the member does not know theforwarding address of the ingress packet because it is the first timethe member has handled the forwarding address, then the member proceedswith block 960324B.

In block 960324A, the member decapsulates the NVO3 packet and forwardsthe decapsulated NVO3 packet to an external switch on the way to theaddress, as the member knows the forwarding address. Then the memberconcludes processing the ingress packet.

In block 960324B, the member notifies the master that the forwardingaddress of the NVO3 packet is unknown. The GS 510 is a gateway capableof routing any packet, and the unknown address is resolved by the masteraccording to the Address Resolution Protocol (ARP). Then the memberconcludes processing the ingress packet.

In block 960325, the master receives a notification seeking an unknownaddress from the member in block 960324B. Then the master proceeds withblock 960326.

In block 960326, the master sends an ARP request to query a next hop MACaddress for the unknown address as notified in block 960325. In oneembodiment of the present invention, the ARP request includes EXT-IP forsource IP, and the MAC for the GS 510 as source MAC. Then the masterwaits until the ARP reply is received from the member in block 960322B,or an ARP reply arrives in the port of the master.

In block 960327, the master receives the ARP reply responding to the ARPrequest sent in block 960326. The ARP reply comprises addressinformation of the unknown address of block 960325. Then the masterproceeds with block 960328.

In block 960328, the master synchronizes members of the GS 510 with theaddress information acquired from the ARP reply such that next time thesame address is examined, the members may process the packet withoutnotifying the master for the unknown address. Then the master concludesprocessing the ingress packet.

FIG. 9G is a detailed flowchart of block 96033 of FIG. 9E, depicting howcross-network traffic is handled by the GS 510 as performed by themaster and a member, in accordance with one or more embodiments setforth herein.

In block 9603301, the member examines the type of packet. Wherein theexternal network attempts to access the NVO3 network serviced by the GS510, the external network first sends an ARP request for the MAC addressof the GS 510. The ARP request travels to the external switch, and tothe ports of any node of the GS 510, according to the static trunkdeployed for the interface from the external switch to the GS 510. Ifthe member determines that the packet is an NVO3 packet, then the memberproceeds with block 9603302A. If the member determines that the packetis an ARP request, then the member proceeds with block 9603302B.

In block 9603302A, the member processes the NVO3 packet according to theinterfaces of TEP-IP and EXT-IP, SNAT pool, forwarding rules and VLANmapping installed in the node pursuant to the configuration file, asunified throughout the nodes of the GS 510. Then the member proceedswith block 9603303, wherein the member notifies the master via themanagement network.

In block 9603302B, the member encapsulates the ARP request by stackingon the packet header and notifies the master.

In block 9603304, in response to the notifications from the member inblocks 9603302B and 9603303, the master determines the type of eventnotified by the member. If the master determines that the notificationis for the ARP request from block 9603302B, then the master proceedswith block 9603305. If the master determines that the notification isfor the NVO3 packet from block 9603303, then the master proceeds withblock 9603308.

In block 9603305, the master processes the ARP request notification.Then the master proceeds with block 9603306.

In block 9603306, the master synchronizes members of the GS 510 with aMAC address of an external network in the ARP request notified such thatthe synchronized members may directly forward NVO3 packets to the MACaddress in the future. Then the master proceeds with block 9603307.

In block 9603307, the master sends, to the external network, an ARPreply corresponding to the ARP request. Then the master concludes thecross-network traffic process.

In block 9603308, the master looks up the destination address from thepolicy server. Then the master proceeds with block 9603309.

In block 9603309, the master determines whether or not the destinationaddress has been found in the policy server from block 9603308. If themaster determines that the destination address has not been found in thepolicy server, then the master proceeds with block 9603310A. If themaster determines that the destination address has been found in thepolicy server, then the master proceeds with block 9603310B.

In block 9603310A, the master sends out an ARP request to query thedestination in the NVO3 network as the destination address has not beenfound in the policy server. Then the master concludes the cross-networktraffic process.

In block 9603310B, the master encapsulates the NVO3 packet using TEP-IPand forwards the encapsulated NVO3 packet to the external switch as thedestination address has been found from the policy server. Then themaster concludes the cross-network traffic process.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below, if any, areintended to include any structure, material, or act for performing thefunction in combination with other claimed elements as specificallyclaimed. The description set forth herein has been presented forpurposes of illustration and description, but is not intended to beexhaustive or limited to the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the disclosure. Theembodiment was chosen and described in order to best explain theprinciples of one or more aspects set forth herein and the practicalapplication, and to enable others of ordinary skill in the art tounderstand one or more aspects as described herein for variousembodiments with various modifications as are suited to the particularuse contemplated.

What is claimed is:
 1. A computer-implemented method, comprising:forming a gateway stack (GS) that includes a master, a backup, and atleast one slave amongst nodes of the GS based on an election pursuant toa gateway stack protocol (GSP), wherein the GS provides gateway servicesfor a Network Virtualization over Layer 3 (NVO3) network in a fail-safemanner by utilizing all of the nodes in the GS, and wherein each node ofthe GS is coupled to a switch via a data interface that is aggregated bya static trunk that enables the switch to evenly distribute inbound datapackets amongst the nodes of the GS.
 2. The method of claim 1, theforming comprising: responsive to obtaining, in a first state, aninstruction to enable a node of the nodes in the GS from a user, settingthe node to a second state in which the node commences communicatingwith other nodes in the GS; multicasting a first GSP packet to all ofthe nodes in the GS according to a packet interval period, wherein thepacket interval period is specified in a GSP packet field; receiving asecond GSP packet sent from one node of the nodes in the GS; responsiveto ascertaining, in the second state, that the node established abidirectional communication channel with the one node from thereceiving, setting the node to a third state in which the node electsthe master and the backup amongst the nodes in the GS; responsive toascertaining, in the third state, that the master and the backup wereelected amongst the nodes pursuant to the GSP, setting the node to afourth state in which the node begins processing data packets; andresponsive to ascertaining, in the fourth state, that the node had notreceived any data packets for a duration of time set in a GSP packetinactivity timer field, setting the node to the second state.
 3. Themethod of claim 2, wherein the GS enters an initialized state based onthat all of the nodes in the GS having entered the second state, whereinthe GS enters a connected state based on that all of the nodes in the GShaving entered the third state, and wherein the GS enters a peer-upstate in which the GS provides the gateway services for the NVO3 networkbased on that all of the nodes in the GS having entered the fourth stateindicating that all of the nodes in the GS are enabled to process thedata packets of the NVO3 network.
 4. The method of claim 2, wherein theascertaining, in the second state, that the node established thebidirectional communication channel with the one node comprises:determining both that multicast destination Internet Protocol (IP)address of the received second GSP packet is set as a preconfiguredaddress value, and that the User Datagram Protocol (UDP) destinationport of the received second GSP packet is set as a preconfigured portnumber; and determining that a neighbor field of the received second GSPpacket includes a network identifier corresponding to the node.
 5. Themethod of claim 2, further comprises: electing the master and thebackup, prior to the ascertaining, in the third state, that the masterand the backup were elected amongst the nodes pursuant to the GSP, byperforming: discovering a master GSP packet having a greatest priorityvalue amongst all gateway priority values, by examining a respectivegateway priority field of received GSP packets from peer nodes in the GSpursuant to the GSP; electing, amongst the peer nodes, a first node thathad sent the master GSP packet as the master of the GS; discovering abackup GSP packet having a second greatest priority value amongst allgateway priority values, by examining a respective gateway priorityfield of received GSP packets pursuant to the GSP; electing, amongst therest of peer nodes other than the master, a second node that had sentthe backup GSP packet as the backup of the GS; and electing all nodes ofthe GS other than the master and the backup as one or more slaves. 6.The method of claim 2, wherein the ascertaining, in the third state,that the master and the backup were elected amongst the nodes comprises:determining that a master address field of the received second GSPpacket has a first IP address that is valid and identical to a virtualaddress field of the received second GSP packet, wherein the masteraddress field and the virtual address field of all GSP packets arerespectively initialized as zero (0) prior to election; and determiningthat a backup address field of the received second GSP packet has asecond IP address that is distinctive from the first IP address.
 7. Themethod of claim 1, further comprising: registering the GS with acontroller and a policy server such that the controller keeps GSregistration information data, and the policy server keeps policy serverlist information data of the GS, wherein the master communicates withthe controller and the policy server via a management interface that isdistinctive from the data interface.
 8. The method of claim 7, theregistering, by the master, comprising: sending the GS registrationinformation data of the master to the controller; and updating thepolicy server list information data of the master, based on the policyserver list information data from the policy server, as being pushed bythe controller.
 9. The method of claim 7, wherein the GS registrationinformation data comprises a virtual tunnel IP address of the GSpursuant to a specification of software defined network for virtualenvironments (SDN VE) that is serviced by the GS.
 10. The method ofclaim 7, wherein the policy server list information data comprises an IPaddress of an overlay virtual machine (VM) coupled to the GS via theswitch, a media access control (MAC) address of an overlay VM, a TunnelEnd Point IP (TEP-IP) address of the overlay VM, a network identifier ofthe overlay VM.
 11. The method of claim 7, further comprising:configuring the nodes of the GS from the registering to enable all nodesin the GS for autonomous processing of an inbound NVO3 data packethaving a destination address known to a receiving node.
 12. The methodof claim 11, the configuring, by the master, comprising: creating aconfiguration file for the gateway services of the GS, pursuant to theGS registration information data obtained from the controller; creatinginterfaces corresponding to the created configuration file;synchronizing respective configuration files of the backup and eachslave of the at least one slave in the GS with the configuration filefrom the creating; registering a tunneling address of the GS with thepolicy server, by which the GS is enabled to provide the gatewayservices to a destination external to the NVO3 network by encapsulation;and notifying the tunneling address from the registering to the switch.13. The method of claim 12, the creating the configuration filecomprising: determining that the GS is deployed as a Layer 3 gatewayservicing an external public network; and recording the configurationfile listing tunneling addresses, network address identification in theexternal public network, source/destination network address translationpools, and forwarding rules of the GS.
 14. The method of claim 12, thecreating the configuration file comprising: determining that the GS isdeployed as a Layer 2 gateway servicing a legacy network for tenants;and recording the configuration file listing tunneling addresses andvirtual local area network (VLAN) mappings.
 15. The method of claim 12,the creating interfaces comprising: setting interfaces of the mastercomprising tunneling address, network address identification in theexternal public network, source/destination network address translationpools, forwarding rules, virtual local area network (VLAN) mappings, anddynamic sessions.
 16. The method of claim 12, further comprising:updating, by the backup and the at least one slave, the respectiveconfiguration files of respective node of the backup and the at leastone slave, based on the synchronizing by the master; and installinginterfaces on respective node pursuant to the updated respectiveconfiguration file.
 17. The method of claim 12, further comprising:operating the GS, responsive to an associated type of a data packet andrespective changes in an environment of the GS, wherein a first changein the environment of the GS from the operating is selected from afailure on the data interface, the management interface, and a node ofthe master, wherein the first change triggers the backup to take over asa new master pursuant to the GSP, without updating the GS registrationinformation data of the controller, and without updating the policyserver list information data of the policy server.
 18. The method ofclaim 17, wherein a second change in the environment of the GS from theoperating is a new node joining the GS, the method further comprising:requesting, by the new node, the master to synchronize a configurationfile of the new member; in response to obtaining a configuration filefrom the master as requested, updating a configuration file of the newnode; and installing interfaces on the new node pursuant to the updatedconfiguration file.
 19. The method of claim 17, the operatingcomprising: determining a direction of the data packet, the directionselected from the group consisting of inbound and cross-network;determining a type of the data packet, the type selected from the groupconsisting of an NVO3 packet, an Address Resolution Protocol (ARP)request, and an ARP reply; wherein the data packet is of inbounddirection and NVO3 packet type, processing, by the receiving node, thedata packet according to interfaces installed in the receiving node,decapsulating, and, in response to ascertaining that the destinationaddress is known to the receiving node, forwarding the data packet to adestination, wherein the data packet is of inbound direction and ARPreply type, encapsulating, by the receiving node, and forwarding thedata packet to the master, wherein the data packet is of cross-networkdirection and NVO3 packet type, processing, by the receiving node, thedata packet according to interfaces installed in the receiving node, andnotifying the data packet to the master, and wherein the data packet isof cross-network direction and ARP request type, encapsulating, by thereceiving node, the data packet and notifying the data packet to themaster.
 20. The method of claim 19, the operating further comprising:wherein the data packet is of inbound direction and NVO3 packet type,receiving, by the master, a notification that the destination address isunknown, in response to ascertaining by the receiving node that thedestination address is unknown to the receiving node, then sending outan ARP request to query the destination address, wherein the data packetis of inbound direction and ARP reply type, receiving, by the master,the data packet, in response to the forwarding by the receiving node,then synchronizing all nodes of the GS with data of the data packet,wherein the data packet is of cross-network direction and NVO3 packettype, sending out, by the master, a new data packet of ARP request type,in response to ascertaining that the destination address has not beendiscovered in the policy server list information data, wherein the datapacket is of cross-network direction and NVO3 packet type,encapsulating, by the master, and forwarding the data packet to thedestination address, in response to ascertaining that the destinationaddress has been discovered in the policy server list information data,and wherein the data packet is of cross-network direction and ARPrequest type, processing, by the master, the data packet, synchronizingall nodes of the GS with data of the data packet, and sending anothernew data packet of ARP reply type to an external network coupled to theswitch.